On two different Characterizations of Bisimulation
نویسندگان
چکیده
AM89] and JNW94] present abstract concepts of bisimulation in terms of category theory. This paper discusses the diierences between their formalisms and deals with the question how to translate these approaches into one another.
منابع مشابه
Co-induction Characterization of Branching Bisimulation with Explicit Divergence∗
Branching bisimulation with explicit divergence, introduced by van Glabbeek and Weijland, is an important relation between processes. It is the weakest equivalence relation which is a branching bisimulation and at the same time divergence preserving. Like branching bisimulation, it has two major characterizations in the literature: a relational characterization and a coloured trace characteriza...
متن کاملLogical characterizations of simulation and bisimulation for fuzzy transition systems
Simulations and bisimulations are known to be useful for abstracting and comparing formal systems, and they have recently been introduced into fuzzy systems. In this study, we provide sound and complete logical characterizations for simulation and bisimulation, which are defined over fuzzy labeled transition systems via two variants of the Hennessy-Milner Logic. The logic for characterizing fuz...
متن کاملUniform Logical Characterizations of Testing Equivalences for Nondeterministic, Probabilistic and Markovian Processes
Logical characterizations of nondeterministic, probabilistic, and Markovian variants of bisimulation equivalence rely on similar modal languages, each including true, negation, conjunction, and diamond. Likewise, logical characterizations of the corresponding variants of trace equivalence rely on similar modal languages, each including only true and diamond. Unfortunately, this is not the case ...
متن کاملBisimulations, Games and Logic
In a recent paper by Joyal, Nielsen, and Winskel, bisimulation is defined in an abstract and uniform way across a wide range of different models for concurrency. In this paper, following a recent trend in theoretical computer science, we characterize their abstract definition game-theoretically and logically in a non-interleaving model. Our characterizations appear as surprisingly simple extens...
متن کاملA Logical Characterization of Efficiency Preorders
In this paper we present logical characterizations of two preorders, within the framework of Hennessy-Milner Logics. The two preorders (loosely termed bisimulation-based efficiency preorders) are on processes represented as labelled transition systems. The characterizations are particularly interesting as they explore preorders lying between strong and weak bisimilarity, guided by a principle o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Bulletin of the EATCS
دوره 59 شماره
صفحات -
تاریخ انتشار 1996